// Copyright (C) Kumo inc. and its affiliates.
// Author: Jeff.li lijippy@163.com
// All rights reserved.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published
// by the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <https://www.gnu.org/licenses/>.
//


#include <pollux/common/base/bit_set.h>

#include <gtest/gtest.h>

using namespace kumo::pollux;

TEST(BitSetTest, basic) {
  constexpr int64_t kMin = 12;
  BitSet bits(kMin);
  bits.insert(1);
  EXPECT_FALSE(bits.contains(1));
  EXPECT_EQ(bits.max(), kMin - 1);
  for (auto i = kMin; i < 1000; i += 2) {
    bits.insert(i);
  }

  EXPECT_EQ(998, bits.max());
  EXPECT_FALSE(bits.contains(0));
  EXPECT_FALSE(bits.contains(10000));
  EXPECT_FALSE(bits.contains(bits::roundUp(998 - kMin, 64) + kMin));
  EXPECT_FALSE(bits.contains(-100));
  for (auto i = kMin; i < 1000; i += 2) {
    EXPECT_TRUE(bits.contains(i));
    EXPECT_FALSE(bits.contains(i + 1));
  }
}
